Substructuring Preconditioners for Mortar Discretization of a Degenerate Evolution Problem
نویسندگان
چکیده
In this paper we present new efficient variants of structured preconditioners for algebraic linear systems arising from the mortar discretization of a degenerate parabolic system of equations. The new approaches extend and adapt the idea of substructuring preconditioners to the discretization of a degenerate problem in electrocardiology. A polylogarithmic bound for the condition number of the preconditioned matrix is proved and validated by numerical experiments.
منابع مشابه
Substructuring Preconditioners for Parabolic Problems by the Mortar Method
We study substructuring preconditioners for the linear system arising from the discretization of parabolic problems when the mortar method is applied. By using a suitable non standard norm equivalence we build an efficient edge block preconditioner and we prove a polylogarithmic bound for the condition number of the preconditioned matrix.
متن کاملPreconditioners for High Order Mortar Methods based on Substructuring
A class of preconditioners for the Mortar Method based on substructuring is studied. We generalize the results of Achdou, Maday and Widlund (AMW99), obtained for the case of order one finite elements, to a wide class of discretization spaces including finite elements of any orders. More precisely, we show that the condition number of the preconditioned matrix grows at most polylogarithmically w...
متن کاملA Numerical Study of FETI Algorithms for Mortar Finite Element Methods
The Finite Element Tearing and Interconnecting (FETI) method is an iterative substructuring method using Lagrange multipliers to enforce the continuity of the nite element solution across the subdomain interface. Mortar nite elements are nonconforming nite elements that allow for a geometrically nonconforming decomposition of the computational domain into subregions and, at the same time, for t...
متن کاملThe Construction of Preconditioners for Elliptic Problems by Substructuring , IV
We consider the problem of solving the algebraic system of equations which result from the discretization of elliptic boundary value problems defined on threedimensional Euclidean space. We develop preconditioners for such systems based on substructuring (also known as domain decomposition). The resulting algorithms are well suited to emerging parallel computing architectures. We describe two t...
متن کاملOn preconditioners for mortar discretization of elliptic problems
1. Introduction. In this paper, we discuss a second order elliptic problem with dis
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Sci. Comput.
دوره 36 شماره
صفحات -
تاریخ انتشار 2008